Cutwidth of the Mesh of dary Trees
نویسنده
چکیده
In this paper we show that the cutwidth of the mesh of d-ary trees MT(d; n) is of order (d n+1), which improves both upper and lower bounds of Barth 2], by a factor of d.
منابع مشابه
Cutwidth of the r-dimensional mesh of d-ary trees
We prove that the cutwidth of the r-dimensional mesh of d-ary trees is of order (d (r?1)n+1), which improves and generalizes the previous result of Barth 2]. Resum e Nous provons que la largeur de coupe de la grille r-dimensionall d'arbres d-naires est d'ordre (d (r?1)n+1), que ameliore et generalise le resultat de Barth 2].
متن کاملOn Bandwidth, Cutwidth, and Quotient Graphs
The bandwidth and the cutwidth are fundamental parameters which can give indications on the complexity of many problems described in terms of graphs. In this paper, we present a method for nding general upper bounds for the bandwidth and the cutwidth of a given graph from those of any of its quotient graphs. Moreover, general lower bounds are obtained by using vertex-and edge-bisection notions....
متن کاملCyclic Cutwidth of the Mesh
The cutwidth problem is to nd a linear layout of a network so that the maximal number of cuts (cw) of a line separating consecutive vertices is minimized. A related and more natural problem is the cyclic cutwidth (ccw) when a circular layout is considered. The main question is to compare both measures cw and ccw for speciic networks, whether adding an edge to a path and forming a cycle reduces ...
متن کاملCutwidth II: Algorithms for partial w-trees of bounded degree
The cutwidth of a graph G is defined to be the smallest integer k such that the vertices of G can be arranged in a vertex ordering [v1, . . . , vn] in a way that, for every i = 1, . . . , n− 1, there are at most k edges with one endpoint in {v1, . . . , vi} and the other in {vi+1, . . . , vn}. We examine the problem of computing in polynomial time the cutwidth of a partial w-tree with bounded d...
متن کاملSpanning tree congestion critical graphs
The linear or cyclic cutwidth of a graph G is the minimum congestion when G is embedded into either a path or a cycle respectively. A graph is cutwith critical if it is homeomorphically minimal and all of its subgraphs have lower cutwitdth. Our purpose is to extend the study of congestion critical graphs to embeddings on spanning trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996